منابع مشابه
Random Tree Growth by Vertex Splitting
Abstract. We study a model of growing planar tree graphs where in each time step we separate the tree into two components by splitting a vertex and then connect the two pieces by inserting a new link between the daughter vertices. This model generalises the preferential attachment model and Ford’s α–model for phylogenetic trees. We develop a mean field theory for the vertex degree distribution,...
متن کاملSign-Compute-Resolve for Tree Splitting Random Access
We present an approach to random access that is based on three elements: physical-layer network coding (PLNC), signature codes and tree splitting. In presence of a collision, physical-layer network coding enables the receiver to decode, i.e., compute the sum of the packets that were transmitted by the individual users. For each user, the packet consists of the user’s signature, as well as the d...
متن کاملThe splitting design that leads to simple random sampling
Implementing unequal probability sampling, without replacement, is very complex and several methods have been suggested for its performance, including : Midseno design and systematic design. One of the methods that have been introduced by Devil and Tille (1998) is the splitting design that leads to simple random sampling .in this paper by completely explaining the design, with an example, we ha...
متن کاملRandom networks with preferential growth and vertex death
A dynamic model for a random network evolving in continuous time is defined where new vertices are born and existing vertices may die. The fitness of a vertex is defined as the accumulated in-degree of the vertex and a new vertex is connected to an existing vertex with probability proportional to a function b of the fitness of the existing vertex. Furthermore, a vertex dies at a rate given by a...
متن کاملMerger and Vertex Splitting in Divisor Graphs
In this paper, we study some operations which produce new divisor graphs from old ones. We prove that the contraction of a divisor graph along a bridge is a divisor graph. For two transmitters (receivers) u and v in some divisor orientation of a divisor graph G, it is shown that the merger G |u,v is also a divisor graph. Two special types of vertex splitting are introduced, one of which produce...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Statistical Mechanics: Theory and Experiment
سال: 2009
ISSN: 1742-5468
DOI: 10.1088/1742-5468/2009/04/p04009